A new general family of mixed graphs
نویسندگان
چکیده
منابع مشابه
New mixed Moore graphs and directed strongly regular graphs
A directed strongly regular graph with parameters (n, k, t, λ, μ) is a k-regular directed graph with n vertices satisfying that the number of walks of length 2 from a vertex x to a vertex y is t if x = y, λ if there is an edge directed from x to y and μ otherwise. If λ = 0 and μ = 1 then we say that it is a mixed Moore graph. It is known that there are unique mixed Moore graphs with parameters ...
متن کاملA new family of (A, N)-implications: Construction and properties
This paper deals with a new family of (A, N)-implications that derived from fuzzy negation and continuous monotone function, and some properties, like the left neutrally, the exchange principle, the ordering property and the laws of contraposition, of the proposed family of (A, N)-implications are studied. Moreover, the T-conditionality and the Modus tollens for the new family of (A, N)-i...
متن کاملA New Family of Mixed Finite Elements for Elasticity
In this thesis, we introduce a new finite element method to discretize the equations of elasticity. It is analyzed thoroughly both in the infinite-dimensional and in the discrete setting, where finite element schemes of arbitrary order are presented. As the main result of this work, we prove that the new method is locking-free with respect to volume and shear locking, i.e that it is applicable ...
متن کاملA new family of random graphs for testing spatial segregation
We discuss a graph-based approach for testing spatial point patterns. This approach falls under the category of data-random graphs, which have been introduced and used for statistical pattern recognition in recent years. Our goal is to test complete spatial randomness against segregation and association between two or more classes of points. To attain this goal, we use a particular type of para...
متن کاملA new family of distance-regular graphs with unbounded diameter
We construct distance-regular graphs with the same classical parameters as the Grassmann graphs on the e-dimensional subspaces of a (2e+1)-dimensional space over an arbitrary finite field. This provides the first known family of non-transitive distance-regular graphs with unbounded diameter.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2019
ISSN: 0166-218X
DOI: 10.1016/j.dam.2018.12.016